Randomisation and Derandomisation in Descriptive Complexity Theory
نویسندگان
چکیده
منابع مشابه
Randomisation and Derandomisation in Descriptive Complexity Theory
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic L, which is defined from L in a similar way as the complexity class BPP, bounded error probabilistic polynomial time, is defined from P. Our main focus lies on questions of derandomisation, and we prove that there is ...
متن کاملDescriptive Complexity Theory for ConstraintDatabasesErich
We consider the data complexity of various logics on two important classes of constraint databases: dense order and linear constraint databases. For dense order databases, we present a general result allowing us to lift results on logics capturing complexity classes from the class of nite ordered databases to dense order constraint databases. Considering linear constraints, we show that there i...
متن کاملFinite Model Theory and Descriptive Complexity
ly, we can describe a two-player game with positional winning conditions by a directed game graph G = (V, V0, V1, E), with a partioning V = V0 ∪ V1 of the nodes into positions where Player 0 moves and positions where Player 1 moves. The possible moves are described by the edge relation E ⊆ V × V . We call w a successor of v if (v, w) ∈ E, and we denote the set of all successors of v by vE. To d...
متن کاملFinite variable logics in descriptive complexity theory
Throughout the development of finite model theory, the fragments of first-order logic with only finitely many variables have played a central role. This survey gives an introduction to the theory of finite variable logics and reports on recent progress in the area. For each k 1 we let Lk be the fragment of first-order logic consisting of all formulas with at most k (free or bound) variables. Th...
متن کاملChaos/Complexity Theory and Education
Sciences exist to demonstrate the fundamental order underlying nature. Chaos/complexity theory is a novel and amazing field of scientific inquiry. Notions of our everyday experiences are somehow in connection to the laws of nature through chaos/complexity theory’s concerns with the relationships between simplicity and complexity, between orderliness and randomness (Retrieved from http://www.inc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2011
ISSN: 1860-5974
DOI: 10.2168/lmcs-7(3:14)2011